ASP-G: an ASP-based method for finding attractors in genetic regulatory networks
نویسندگان
چکیده
منابع مشابه
ASP-G: an ASP-based method for finding attractors in genetic regulatory networks
MOTIVATION Boolean network models are suitable to simulate GRNs in the absence of detailed kinetic information. However, reducing the biological reality implies making assumptions on how genes interact (interaction rules) and how their state is updated during the simulation (update scheme). The exact choice of the assumptions largely determines the outcome of the simulations. In most cases, how...
متن کاملASP for Construction and Validation of Regulatory Biological Networks
In this chapter, we present a declarative approach for analyzing and building genetic regulatory networks (GRNs). A declarative approach is not only restricted to check properties of a fixed network, but also aims at logically specifying networks that satisfies a given set of constraints. Here, we cover two aspects of this approach. First, we propose an implementation of a model checker for lin...
متن کاملAn ASP-Based System for e-Tourism
In this paper we present the IDUM system, a successful application of logic programming to e-tourism. IDUM exploits two technologies that are based on the state-of-the-art ASP system DLV: (i) a system for ontology representation and reasoning, called OntoDLV; and, (ii) HıLεX a semantic information extraction tool. The core of IDUM is an ontology which models the domain of the touristic offers. ...
متن کاملASP at Work: An ASP Implementation of PhyloWS
This paper continues the exploration started in [3], aimed at demonstrating the use of logic programming technology to support a large scale deployment and analysis of phylogenetic data from biological studies. This application paper illustrates the use of ASP technology in implementing the PhyloWS web service API—a recently proposed and community-agreed standard API to enable uniform access an...
متن کاملASPQ: An ASP-Based 2QBF Solver
Answer Set Programming (ASP) is an established logic-based programming paradigm which has been successfully applied for solving complex problems. Since ASP can model problems up to the second level of the polynomial hierarchy, it can be used to model and solve the 2QBF problem. In this paper we show how to obtain a fairly effective 2QBF solver by just resorting to state-of-the-art ASP solvers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2014
ISSN: 1460-2059,1367-4803
DOI: 10.1093/bioinformatics/btu481